Parallel Particle Swarm Optimization on GPU with Application to Trajectory Optimization
نویسندگان
چکیده
In simulation-based design optimization, one of the greatest challenges is the intensive computing burden. In order to reduce the computational time, a parallel implementation of the particle swarm optimization (PSO) algorithm on graphic processing unit (GPU) is presented in this paper. Instead of executed on the central processing unit (CPU) in a serial manner, the PSO algorithm is executed in parallel taking advantage of the general-purpose computing ability of GPU in the platform of compute unified device architecture (CUDA). The processes of the fitness evaluation, the updating of velocity and position of all the particles of PSO are parallelized and respectively introduced in detail. Comparative studies on optimization of three benchmark test functions are conducted by running the PSO algorithm on GPU (GPU-PSO) as well as CPU (CPUPSO), respectively. The impact of design dimension, as well as the number of particles and optimization iteration in PSO on the computational time is investigated. From test results, it is observed that the computational time of GPU-PSO is much shorter compared to that of CPUPSO, which demonstrates the remarkable speedup capability of GPU-PSO. Finally, GPU-PSO is applied to a practical gliding trajectory optimization problem to reduce the computing time, which further demonstrates the effectiveness of GPU-PSO.
منابع مشابه
Parallel Implementation of Particle Swarm Optimization Variants Using Graphics Processing Unit Platform
There are different variants of Particle Swarm Optimization (PSO) algorithm such as Adaptive Particle Swarm Optimization (APSO) and Particle Swarm Optimization with an Aging Leader and Challengers (ALC-PSO). These algorithms improve the performance of PSO in terms of finding the best solution and accelerating the convergence speed. However, these algorithms are computationally intensive. The go...
متن کاملAn approach to Improve Particle Swarm Optimization Algorithm Using CUDA
The time consumption in solving computationally heavy problems has always been a concern for computer programmers. Due to simplicity of its implementation, the PSO (Particle Swarm Optimization) is a suitable meta-heuristic algorithm for solving computationally heavy problems. However, despite the simplicity, the algorithm is inefficient for solving real computationally heavy problems but the pr...
متن کاملAN OPTIMAL FUZZY SLIDING MODE CONTROLLER DESIGN BASED ON PARTICLE SWARM OPTIMIZATION AND USING SCALAR SIGN FUNCTION
This paper addresses the problems caused by an inappropriate selection of sliding surface parameters in fuzzy sliding mode controllers via an optimization approach. In particular, the proposed method employs the parallel distributed compensator scheme to design the state feedback based control law. The controller gains are determined in offline mode via a linear quadratic regular. The particle ...
متن کاملPARTICLE SWARM-GROUP SEARCH ALGORITHM AND ITS APPLICATION TO SPATIAL STRUCTURAL DESIGN WITH DISCRETE VARIABLES
Based on introducing two optimization algorithms, group search optimization (GSO) algorithm and particle swarm optimization (PSO) algorithm, a new hybrid optimization algorithm which named particle swarm-group search optimization (PS-GSO) algorithm is presented and its application to optimal structural design is analyzed. The PS-GSO is used to investigate the spatial truss structures with discr...
متن کاملA Modified Discreet Particle Swarm Optimization for a Multi-level Emergency Supplies Distribution Network
Currently, the research of emergency supplies distribution and decision models mostly focus on deterministic models and exact algorithm. A few of studies have been done on the multi-level distribution network and matheuristic algorithm. In this paper, random processes theory is adopted to establish emergency supplies distribution and decision model for multi-level network. By analyzing the char...
متن کامل